Pseudo-LYM Inequalities and AZ Identities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo-LYM inequalities and AZ identities

We give pseudo-LYM inequalities in some posets and give a new restriction in this way for their antichains. Typically these posets fail the LYM inequality and some of them are known not to be Sperner.

متن کامل

Polynomial Lym Inequalities

For a Sperner family A ⊆ 2 [n] let Ai denote the family of all i-element sets in A. We sharpen the LYM inequality i |Ai|/ n i ≤ 1 by adding to the LHS all possible products of fractions |Ai|/ n i , with suitable coefficients. A corresponding inequality is established also for the linear lattice and the lattice of subsets of a multiset (with all elements having the same multiplicity).

متن کامل

Nonlinear Picone identities to Pseudo $p$-Laplace operator and applications

In this paper, we derive a nonlinear Picone identity to the pseudo p-Laplace operator, which contains some known Picone identities and removes a condition used in many previous papers. Some applications are given including a Liouville type theorem to the singular pseudo p-Laplace system, a Sturmian comparison principle to the pseudo p-Laplace equation, a new Hardy type inequality with weight an...

متن کامل

Pseudo-Identities and Bordered Words

This paper investigates the notions of θ-bordered words and θ-unbordered words for various pseudo-identity functions θ. A θ-bordered word is a non-empty word u such that there exists a word v which is a prefix of u while θ(v) is a suffix of u. The case where θ is the identity function corresponds to the classical notions of bordered and unbordered words. Here we explore cases where θ is a pseud...

متن کامل

Identities and Inequalities for Tree Entropy

The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses Fuglede–Kadison determinants, while another uses effective resistance. We use the latter to prove that tree entropy respects stochastic domination. We also prove th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 1997

ISSN: 0196-8858

DOI: 10.1006/aama.1997.0542